At least seven people were killed in Russian strikes across Ukraine overnight, including five in the central city of Dnipro, where officials said an apartment building was hit. Ukrainian President Volodymyr Zelensky said the latest attack lasted practically all night, while rescue workers were still searching for survivors under rubble in Dnipro on Saturday morning. British jets were scrambled from Romania during the heavy attack when Russian drones were detected near the border, though the UK Ministry of Defence rejected a report it had shot some down. Meanwhile, Ukraine carried out some of its longest-distance drone strikes deep inside Russian territory. In Yekaterinburg, almost 1,000 miles (1,600km) from Ukraine's border, the governor said six people were injured when a building was struck - while in nearby Chelyabinsk, a local leader said drones targeting an industrial facility were shot down.

On a commercial thoroughfare in old town Pasadena, California, a stone's throw from NASA's Jet Propulsion Laboratory (JPL), you'll find the Neon Retro Arcade. Among its collection of vintage video games is the 1979 Atari classic Asteroids, in which a pixelated spaceship shoots down a barrage of space rocks to stave off fatal collisions. After long days of work at JPL, Amy Mainzer used to rack up high scores on that console. "It was a hoot," she says. It was also apt, considering she oversees a space mission designed to spot dangerous asteroids before they crash into Earth. That mission, the Near-Earth Object (NEO) Surveyor, was conceived in the early 2000s and finally got the green light in 2022. Its components are now being built, tested, and assembled in clean rooms across the United States ahead of its planned launch in September 2027. "We're in the thick of building everything," says Mainzer, NEO Surveyor's principal investigator and now an astronomer at the University of California, Los Angeles (UCLA).

Hyabusa2 is already 105.5 million miles on its journey, but new data indicates trouble. Breakthroughs, discoveries, and DIY tips sent every weekday. Japan's Hyabusa2 space probe is currently about 105.5 million miles away, en route to its second asteroid rendezvous . However, revised data collected from a global network of observatories now indicates that the space rock designated as 1998 KY26 will look and behave far differently than astronomers previously theorized--and it may prove disastrous for the tiny explorer. In 2010, the Japanese Aerospace Exploration Agency (JAXA) made history when its Hayabusa probe became the first spacecraft to not only land on and launch from an asteroid (Itokawa), but successfully return to Earth with samples .

--Classifying potentially hazardous asteroids (PHAs) is crucial for planetary defense and deep space navigation, yet traditional methods often overlook the dynamical relationships among asteroids. We introduce a Graph Neural Network (GNN) approach that models asteroids as nodes with orbital and physical features, connected by edges representing their similarities, using a NASA dataset of 958,524 records. Despite an extreme class imbalance with only 0.22% of the dataset with hazardous label, our model achieves an overall accuracy of 99% and an AUC of 0.99, with a recall of 78% and an F1-score of 37% for hazardous asteroids after applying Synthetic Minority Oversampling T echnique. Feature importance analysis highlights albedo, perihelion distance, and semi-major axis as main predictors. This framework supports planetary defense missions and confirm AI's potential in enabling autonomous navigation for future missions such as NASA's NEO Surveyor and ESA's Ramses, offering an interpretable and scalable solution for asteroid hazard assessment. However, a small subset known as potentially hazardous asteroids (PHAs) follow orbits that bring them perilously close to our planet, raising the specter of catastrophic collisions. Historical events, such as the 1908 Tunguska explosion [1], which devastated over 2,000 square kilometers of Siberian forest, and the 2013 Chelyabinsk meteor [2], which injured over 1,000 people and caused widespread property damage, show the destructive potential of these celestial bodies.

The potential for catastrophic collision makes near-Earth asteroids (NEAs) a serious concern. Planetary defense depends on accurately classifying potentially hazardous asteroids (PHAs), however the complexity of the data hampers conventional techniques. This work offers a sophisticated method for accurately predicting hazards by combining machine learning, deep learning, explainable AI (XAI), and anomaly detection. Our approach extracts essential parameters like size, velocity, and trajectory from historical and real-time asteroid data. A hybrid algorithm improves prediction accuracy by combining several cutting-edge models. A forecasting module predicts future asteroid behavior, and Monte Carlo simulations evaluate the likelihood of collisions. Timely mitigation is made possible by a real-time alarm system that notifies worldwide monitoring stations. This technique enhances planetary defense efforts by combining real-time alarms with sophisticated predictive modeling.

The rapid increase in textual information means we need more efficient methods to sift through, organize, and understand it all. While retrieval-augmented generation (RAG) models excel in accessing information from large document collections, they struggle with complex tasks that require aggregation and reasoning over information spanning across multiple documents--what we call holistic reasoning. Long-context language models (LCLMs) have great potential for managing large-scale documents, but their holistic reasoning capabilities remain unclear. In this work, we introduce HoloBench, a novel framework that brings database reasoning operations into text-based contexts, making it easier to systematically evaluate how LCLMs handle holistic reasoning across large documents. Our approach adjusts key factors such as context length, information density, distribution of information, and query complexity to evaluate LCLMs comprehensively. Our experiments show that the amount of information in the context has a bigger influence on LCLM performance than the actual context length. Furthermore, the complexity of queries affects performance more than the amount of information, particularly for different types of queries. Interestingly, queries that involve finding maximum or minimum values are easier for LCLMs and are less affected by context length, even though they pose challenges for RAG systems. However, tasks requiring the aggregation of multiple pieces of information show a noticeable drop in accuracy as context length increases. Additionally, we find that while grouping relevant information generally improves performance, the optimal positioning varies across models. Our findings surface both the advancements and the ongoing challenges in achieving a holistic understanding of long contexts.

When designing a public transportation network in a country, one may want to minimise the sum of travel duration of all inhabitants. This corresponds to a purely utilitarian view and does not involve any fairness consideration, as the resulting network will typically benefit the capital city and/or large central cities while leaving some peripheral cities behind. On the other hand, a more egalitarian view will allow some people to travel between peripheral cities without having to go through a central city. We define a model, propose algorithms for computing solution networks, and report on experiments based on real data.

Hazardous asteroid has been one of the concerns for humankind as fallen asteroid on earth could cost a huge impact on the society.Monitoring these objects could help predict future impact events, but such efforts are hindered by the large numbers of objects that pass in the Earth's vicinity. The aim of this project is to use machine learning and deep learning to accurately classify hazardous asteroids. A total of ten methods which consist of five machine learning algorithms and five deep learning models are trained and evaluated to find the suitable model that solves the issue. We experiment on two datasets, one from Kaggle and one we extracted from a web service called NeoWS which is a RESTful web service from NASA that provides information about near earth asteroids, it updates every day. In overall, the model is tested on two datasets with different features to find the most accurate model to perform the classification.

Predictive Maintenance (PdM) emerged as one of the pillars of Industry 4.0, and became crucial for enhancing operational efficiency, allowing to minimize downtime, extend lifespan of equipment, and prevent failures. A wide range of PdM tasks can be performed using Artificial Intelligence (AI) methods, which often use data generated from industrial sensors. The steel industry, which is an important branch of the global economy, is one of the potential beneficiaries of this trend, given its large environmental footprint, the globalized nature of the market, and the demanding working conditions. This survey synthesizes the current state of knowledge in the field of AI-based PdM within the steel industry and is addressed to researchers and practitioners. We identified 219 articles related to this topic and formulated five research questions, allowing us to gain a global perspective on current trends and the main research gaps. We examined equipment and facilities subjected to PdM, determined common PdM approaches, and identified trends in the AI methods used to develop these solutions. We explored the characteristics of the data used in the surveyed articles and assessed the practical implications of the research presented there. Most of the research focuses on the blast furnace or hot rolling, using data from industrial sensors. Current trends show increasing interest in the domain, especially in the use of deep learning. The main challenges include implementing the proposed methods in a production environment, incorporating them into maintenance plans, and enhancing the accessibility and reproducibility of the research.

In sparse linear bandits, a learning agent sequentially selects an action and receive reward feedback, and the reward function depends linearly on a few coordinates of the covariates of the actions. This has applications in many real-world sequential decision making problems. In this paper, we propose a simple and computationally efficient sparse linear estimation method called PopArt that enjoys a tighter $\ell_1$ recovery guarantee compared to Lasso (Tibshirani, 1996) in many problems. Our bound naturally motivates an experimental design criterion that is convex and thus computationally efficient to solve. Based on our novel estimator and design criterion, we derive sparse linear bandit algorithms that enjoy improved regret upper bounds upon the state of the art (Hao et al., 2020), especially w.r.t. the geometry of the given action set. Finally, we prove a matching lower bound for sparse linear bandits in the data-poor regime, which closes the gap between upper and lower bounds in prior work.